%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/


%% Created for Eric Xu at 2011-02-04 12:51:21 -0600 


%% Saved with string encoding Unicode (UTF-8) 


@string{ieeeac = {IEEE Trans. on Automatic Control}}

@string{ieeeaes = {IEEE Trans. on Aerospace and Electronic Systems}}

@string{jair = {Journal of Artificial Intelligence Research}}


@inproceedings{Gerevi02,
	Author = {A. Gerevini and I. Serina},
	Booktitle = {Proc. of the Sixth Int. Conf. on AI Planning and Scheduling},
	Pages = {12-22},
	Publisher = {Morgan Kaufman},
	Title = {{LPG}: a Planner based on Local Search for Planning Graphs with Action Costs},
	Year = {2002}}

@inproceedings{Selman92,
	Author = {B. Selman and H. Levesque and D. Mitchell},
	Booktitle = {Proc. AAAI},
	Pages = {440-446},
	Title = {A new method for solving hard satisfiability problems},
	Year = {1992}}

@MISC{IPC6,
AUTHOR = "{The Sixth International Planning Competition}",
TITLE = "http://ipc.informatik.uni-freiburg.de/",
year = "2008"
}


@MISC{IPC5,
AUTHOR = "{The Fifth International Planning Competition}",
TITLE = "http://zeus.ing.unibs.it/ipc-5/",
year = "2006"
}

@MISC{IPC4,
AUTHOR = "{T}he {F}ourth {I}nternational {P}lanning {C}ompetition",
TITLE = "http://ls5-www.cs.uni-dortmund.de/{$\sim$}edelkamp/ipc-4/",
year = "2004"
}

@MISC{IPC3,
AUTHOR = "{T}he {T}hird {I}nternational {P}lanning {C}ompetition",
TITLE = "http://planning.cis.strath.ac.uk/competition/",
year = "2004"
}
	
@article{NabZom95,
	Author = {T. M. Nabhan and A. Y. Zomaya},
	Journal = {IEEE Trans. on Parallel and Distributed Systems},
	Month = Dec,
	Number = 12,
	Pages = {1226-1233},
	Title = {A parallel simulated annealing algorithm with low communication overhead},
	Url = {http://novel.crhc.uiuc.edu/papers.db/n/NabZom95.pdf},
	Volume = 6,
	Year = 1995,
	Bdsk-Url-1 = {http://novel.crhc.uiuc.edu/papers.db/n/NabZom95.pdf}}

@inproceedings{Fern04,
	Author = {Alan Fern and Sung Wook Yoon and Robert Givan},
	Booktitle = {ICAPS},
	Pages = {191-199},
	Title = {Learning domain-specific control knowledge from random walks},
	Year = {2004}}

@inproceedings{Lavalle06,
	Author = {S. M. LaValle},
	Booktitle = {Cambridge University Press, Cambridge, U.K.},
	Title = {Planning Algorithm},
	Year = {2006}}

@inproceedings{Bryce06,
	Author = {Daniel Bryce and Subbarao Kambhampati and David E. Smith},
	Booktitle = {ICAPS},
	Pages = {233-242},
	Title = {Sequential Monte Carlo in probabilistic planning reachability heuristics},
	Year = {2006}}

@inproceedings{Nakhost09,
	Author = {Hootan Nakhost and Martin Msller},
	Booktitle = {Proc. IJCAI},
	Pages = {1766-1771},
	Title = {Monte-Carlo Exploration for Deterministic Planning},
	Year = {2009}}

@inproceedings{IJCAI09a,
	Author = {Y. Chen and G. Yao},
	Booktitle = {Proc. IJCAI},
	Title = {Completeness and Optimality Preserving Reduction for Planning},
	Year = {2009}}

@inproceedings{IJCAI09b,
	Author = {Y. Chen and Y. Xu and G. Yao},
	Booktitle = {Proc. IJCAI},
	Title = {Stratified Planning},
	Year = {2009}}

@inproceedings{Valmari91a,
	Author = {A. Valmari},
	Booktitle = {Proceedings of the 10th International Conference on Applications and Theory of Petri Nets},
	Title = {Stubborn sets for reduced state space generation},
	Year = {1989}}

@article{helmert06,
	Author = {M. Helmert},
	Journal = {Journal of Artificial Intelligence Research},
	Pages = {191--246},
	Title = {The {Fast} {Downward} Planning System},
	Volume = {26},
	Year = {2006}}

@inproceedings{Helmert08,
	Author = {Helmert, Malte and R\"{o}ger, Gabriele},
	Booktitle = {Proc. AAAI},
	Pages = {944--949},
	Title = {How good is almost perfect},
	Year = {2008}}

@inproceedings{Giunchiglia99,
	Author = {F. Giunchiglia and P. Traverso},
	Booktitle = {{ECP}},
	Pages = {1-20},
	Title = {Planning as Model Checking},
	Year = {1999}}

@inproceedings{Hoffmann02,
	Author = {J{\"o}rg Hoffmann},
	Booktitle = {AIPS},
	Pages = {92-100},
	Title = {Local Search Topology in Planning Benchmarks: A Theoretical Analysis},
	Year = {2002}}

@inproceedings{Hoffmann01,
	Author = {J{\"o}rg Hoffmann},
	Booktitle = {IJCAI},
	Pages = {453-458},
	Title = {Local Search Topology in Planning Benchmarks: An Empirical Analysis},
	Year = {2001}}

@inproceedings{Richter09,
	Author = {Silvia Richter and Malte Helmert},
	Booktitle = {Proc. ICAPS},
	Title = {Preferred Operators and Deferred Evaluation in Satisficing Planning},
	Year = {2009}}

@inproceedings{Cimatti97,
	Author = {A. Cimatti and E. Giunchiglia and F. Giunchiglia1 and P. Traverso},
	Booktitle = {Recent Advances in AI Planning},
	Title = {Planning via model checking: A decision procedure for AR},
	Year = 1997}

@inproceedings{Edelkamp00,
	Author = {S. Edelkamp and M. Helmert},
	Booktitle = {In Proceedings of AIPS-00 Workshop on Model Theoretic Approaches to Planning},
	Pages = {18--25},
	Publisher = {AAAI press},
	Title = {On the Implementation of MIPS},
	Year = {2000}}

@inproceedings{satplan,
	Author = {Kautz, Henry A. and Selman, Bart and Hoffmann, J{\"{o}}rg},
	Booktitle = {Abstracts of the 5th International Planning Competition},
	Key = {planning},
	Title = {{SatPlan}: Planning as Satisfiability},
	Year = {2006}}

@article{maxplan,
	Address = {Essex, UK},
	Author = {Chen, Yixin and Huang, Ruoyun and Xing, Zhao and Zhang, Weixiong},
	Doi = {http://dx.doi.org/10.1016/j.artint.2008.11.004},
	Issn = {0004-3702},
	Journal = {Artif. Intell.},
	Number = {2},
	Pages = {365--391},
	Publisher = {Elsevier Science Publishers Ltd.},
	Title = {Long-distance mutual exclusion for planning},
	Volume = {173},
	Year = {2009},
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.artint.2008.11.004}}

@article{ff,
	Author = {J\"{o}rg Hoffmann},
	Journal = {AI magazine},
	Pages = {57--62},
	Title = {FF: The Fast-Forward Planning System},
	Volume = {22},
	Year = {2001}}

@inproceedings{RichterHW08,
	Author = {S. Richter and M. Helmert and M. Westphal},
	Booktitle = {Proc. AAAI},
	Pages = {975-982},
	Title = {Landmarks Revisited},
	Year = {2008}}

@book{Barr95,
	Author = {M. Barr and C. Wells},
	Publisher = {Prentice-Hall},
	Title = {Category Theory for Computer Science},
	Year = 1995}

@book{aima,
	Author = {Russell, Stuart J. and Norvig, Peter},
	Isbn = {0137903952},
	Publisher = {Pearson Education},
	Title = {Artificial Intelligence: A Modern Approach},
	Year = {2003}}

@article{sgplan,
	Address = {USA},
	Author = {Y. Chen and B. Wah and C-W. Hsu},
	Issn = {1076-9757},
	Journal = {J. Artif. Int. Res.},
	Number = {1},
	Pages = {323--369},
	Publisher = {AI Access Foundation},
	Title = {Temporal planning using subgoal partitioning and resolution in SGPlan},
	Volume = {26},
	Year = {2006}}

@inproceedings{EvangelistaP07,
	Author = {Sami Evangelista and Christophe Pajault},
	Booktitle = {SPIN},
	Pages = {76-94},
	Title = {Some Solutions to the Ignoring Problem},
	Year = {2007}}

@article{Blum95,
	Author = {Avrim L. Blum and Merrick L. Furst},
	Journal = {Artificial Intelligence},
	Pages = {1636--1642},
	Title = {Fast Planning Through Planning Graph Analysis},
	Volume = {90},
	Year = {1995}}

@inproceedings{Erol94,
	Author = {Kutluhan Erol and James Hendler and Dana S. Nau},
	Booktitle = {In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94)},
	Pages = {1123--1128},
	Publisher = {AAAI Press},
	Title = {HTN Planning: Complexity and Expressivity},
	Year = {1994}}

@conference{Arvindam89,
	Author = {Arvindam, S. and Kumar, V. and Rao, V.N.},
	Booktitle = {Proceedings of the 1989 IEEE International Conference on Computer Design},
	Pages = {109--114},
	Title = {{Floorplan optimization on multiprocessors}},
	Year = {1989}}

@article{Bixby95,
	Author = {Bixby, R.E. and Cook, W. and Cox, A. and others},
	Journal = {Tech. Rep. CRPC-TR95554, Rice University, Center for Research on Parallel Computation, Research Monograph},
	Title = {{Parallel mixed integer programming}},
	Year = {1995}}

@article{Brungger98,
	Author = {Brungger, A. and Marzetta, A. and Clausen, J. and others},
	Journal = {Journal of Parallel and Distributed Computing},
	Number = {1-2},
	Pages = {157--169},
	Publisher = {Elsevier},
	Title = {{Solving large-scale qap problems in parallel with the search library zram}},
	Volume = {50},
	Year = {1998}}

@article{Cun95,
	Author = {Cun, B.L. and Roucairol, C.},
	Journal = {Tech. Rep. N95/16, Universiti De Versailles Saint Quentin},
	Title = {{BOB: A unified platform for implementing branch-and-bound like algorithms}},
	Year = {1995}}

@article{Dijkstra83,
	Author = {Dijkstra, E.W. and Feijen, W.H.J. and Gasteren, A.J.M.},
	Journal = {Information Processing Letters},
	Number = {5},
	Pages = {217--219},
	Title = {{Derivation of a termination detection algorithm for distributed computations}},
	Volume = {16},
	Year = {1983}}

@article{Dutt94,
	Author = {Dutt, S. and Mahapatra, N.R.},
	Journal = {Journal of Parallel and Distributed Computing},
	Number = {3},
	Pages = {488--505},
	Title = {{Scalable load balancing strategies for parallel A* algorithms}},
	Volume = {22},
	Year = {1994}}

@article{Eckstein97,
	Author = {Eckstein, J.},
	Journal = {Computational Optimization and Applications},
	Number = {2},
	Pages = {199--220},
	Publisher = {Springer},
	Title = {{Distributed versus centralized storage and control for parallel branch and bound: mixed integer programming on the CM-5}},
	Volume = {7},
	Year = {1997}}

@article{Eckstein94,
	Author = {Eckstein, J.},
	Journal = {SIAM Journal on Optimization},
	Pages = {794},
	Title = {{Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5}},
	Volume = {4},
	Year = {1994}}

@conference{Evett90,
	Author = {Evett, M. and Mahanti, J.H.A. and Nau, D.},
	Booktitle = {Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation},
	Organization = {IEEE Computer Society},
	Pages = {145-149},
	Title = {{PRA*: A memory-limited heuristic search procedure for the Connection Machine}},
	Year = {1990}}

@conference{Feldmann94,
	Author = {Feldmann, R. and Mysliwiete, P. and Monien, B.},
	Booktitle = {Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures},
	Organization = {ACM},
	Pages = {103},
	Title = {{Studying overheads in massively parallel min/max-tree evaluation}},
	Year = {1994}}

@conference{Ferguson88,
	Author = {Ferguson, C. and Korf, R.},
	Booktitle = {Proceedings of the 1988 National Conference on Artificial Intelligence},
	Title = {{Distributed tree search and its application to alpha-beta pruning}},
	Year = {1988}}

@article{Ferreira96,
	Author = {Ferreira, A. and Pardalos, P.},
	Journal = {Lecture Notes in Computer Science},
	Publisher = {Springer},
	Title = {{Solving combinatorial optimization problems in parallel: methods and techniques}},
	Year = {1996}}

@article{Finkel87,
	Author = {Finkel, R. and Manber, U.},
	Journal = {ACM Transactions on Programming Languages and Systems},
	Number = {2},
	Pages = {256},
	Publisher = {ACM},
	Title = {{DIB-A distributed implementation of backtracking}},
	Volume = {9},
	Year = {1987}}

@conference{Furuichi90,
	Author = {Furuichi, M. and Taki, K. and Ichiyoshi, N.},
	Booktitle = {Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
	Organization = {ACM},
	Pages = {50-59},
	Title = {{A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI}},
	Year = {1990}}

@article{Hamilton97,
	Author = {Hamilton, S. and Garber, L.},
	Journal = {Computer},
	Number = {10},
	Pages = {29--35},
	Title = {{Deep Blue's hardware-software synergy}},
	Volume = {30},
	Year = {1997}}

@phdthesis{Hsu89,
	Author = {Hsu, F.H.},
	Publisher = {Carnegie Mellon University Pittsburgh, PA, USA},
	Title = {{Large-scale parallelization of alpha-beta search: an algorithmic and architectural study with computer chess}},
	Year = {1989}}

@conference{Hsu95,
	Author = {Hsu, F.H. and Campbell, M.S. and Hoane Jr, A.J.},
	Booktitle = {Proceedings of the 9th International Conference on Supercomputing},
	Organization = {ACM New York, NY, USA},
	Pages = {240--244},
	Title = {{Deep Blue system overview}},
	Year = {1995}}

@article{Janakiram88,
	Author = {Janakiram, V.K. and Agrawal, D.P. and Mehrotra, R.},
	Journal = {IEEE Transactions on Computers},
	Number = {12},
	Pages = {1665--1676},
	Title = {{A randomized parallel backtracking algorithm}},
	Volume = {37},
	Year = {1988}}

@article{Johnson97,
	Author = {Johnson, E. and Nemhauser, G. and Savelsbergh, M.},
	Journal = {Tech. Rep., School of Industrial and Systems Engineering, Georgia Institute of Technology},
	Title = {{Progress in integer programming: an exposition}},
	Year = {1997}}

@article{Kale90,
	Author = {Kale, L.V. and Saletore, V.A.},
	Journal = {International Journal of Parallel Programming},
	Number = {4},
	Pages = {251--293},
	Publisher = {Springer},
	Title = {{Parallel state-space search for a first solution with consistent linear speedups}},
	Volume = {19},
	Year = {1990}}

@book{Kanal88,
	Author = {Kanal, L. and Kumar, V.},
	Publisher = {Springer-Verlag},
	Title = {{Search in artificial intelligence}},
	Year = {1988}}

@article{Karp93,
	Author = {Karp, R.M. and Zhang, Y.},
	Journal = {Journal of the ACM},
	Number = {3},
	Pages = {765--789},
	Publisher = {ACM},
	Title = {{Randomized parallel algorithms for backtrack search and branch-and-bound computation}},
	Volume = {40},
	Year = {1993}}

@article{Karypis94,
	Author = {Karypis, G. and Kumar, V.},
	Journal = {IEEE Transactions on Parallel and Distributed Systems},
	Pages = {1057--1072},
	Publisher = {IEEE Computer Society},
	Title = {{Unstructured tree search on SIMD parallel computers}},
	Year = {1994}}

@book{Kumar94a,
	Author = {Kumar, V. and Grama, A. and Gupta, A. and others},
	Publisher = {Benjamin Cummings},
	Title = {{Introduction to parallel computing: design and analysis of algorithms}},
	Year = {1994}}

@article{Kumar94b,
	Author = {Kumar, V. and Grama, A. and Vempaty, N.R.},
	Journal = {Journal of Parallel and Distributed Computing},
	Number = {1},
	Pages = {60--79},
	Title = {{Scalable load balancing techniques for parallel computers}},
	Volume = {22},
	Year = {1994}}

@article{Kumar83,
	Author = {Kumar, V. and Kanal, L.N.},
	Journal = {Artificial Intelligence},
	Number = {1-2},
	Pages = {179--198},
	Publisher = {Elsevier},
	Title = {{A general branch and bound formulation for understanding and synthesizing and/or tree search procedures}},
	Volume = {21},
	Year = {1983}}

@article{Lai84,
	Author = {Lai, T.H. and Sahni, S.},
	Journal = {Communications of the ACM},
	Number = {6},
	Pages = {602},
	Publisher = {ACM},
	Title = {{Anomalies in parallel branch-and-bound algorithms}},
	Volume = {27},
	Year = {1984}}

@conference{Lee97,
	Author = {Lee, E.K. and Mitchell, J.E.},
	Booktitle = {Proceedings for SIAM Conference on Parallel Processing for Scientific Computing},
	Title = {{Computational experience of an interior-point algorithm in a parallel branch-and-cut framework}},
	Year = {1997}}

@article{Li90,
	Author = {Li, G.J. and Wah, B.W.},
	Journal = {IEEE Transactions on Software Engineering},
	Number = {1},
	Pages = {13--31},
	Title = {{Computational efficiency of parallel combinatorial OR-tree searches}},
	Volume = {16},
	Year = {1990}}

@article{Li86,
	Author = {Li, G.J. and Wah, B.W.},
	Journal = {IEEE Transactions on Computers},
	Number = {6},
	Pages = {568--573},
	Title = {{Coping with anomalies in parallel branch-and-bound algorithms}},
	Volume = {35},
	Year = {1986}}

@article{Li94,
	Author = {Li, Y. and Pardalos, P.M. and Ramakrishnan, K.G. and others},
	Journal = {Annals of Operations Research},
	Number = {1},
	Pages = {387--410},
	Publisher = {Springer},
	Title = {{Lower bounds for the quadratic assignment problem}},
	Volume = {50},
	Year = {1994}}

@article{Mahapatra97,
	Author = {Mahapatra, N.R. and Dutt, S.},
	Journal = {IEEE Transactions on Parallel and Distributed Systems},
	Number = {7},
	Pages = {738--756},
	Title = {{Scalable global and local hashing strategies for duplicate pruningin parallel A* graph search}},
	Volume = {8},
	Year = {1997}}

@article{Mans95,
	Author = {Mans, B. and Mautor, T. and Roucairol, C.},
	Journal = {European Journal of Operational Research},
	Number = {3},
	Pages = {617--628},
	Publisher = {Elsevier},
	Title = {{A parallel depth first search branch and bound algorithm for the quadratic assignment problem}},
	Volume = {81},
	Year = {1995}}

@article{Mans96,
	Author = {Mans, B. and Roucairol, C.},
	Journal = {Discrete Applied Mathematics},
	Number = {1},
	Pages = {57--74},
	Title = {{Performances of parallel branch and bound algorithms with best-first search}},
	Volume = {66},
	Year = {1996}}

@conference{Manzini90,
	Author = {Manzini, G. and Somalvico, M.},
	Booktitle = {Proceedings of the International Symposium on Artificial Intelligence and Mathematics},
	Title = {{Probabilistic performance analysis of heuristic search using parallel hash tables}},
	Year = {1990}}

@article{Marsland82,
	Author = {Marsland, T.A. and Campbell, M.},
	Journal = {ACM Computing Surveys},
	Number = {4},
	Pages = {533--551},
	Publisher = {ACM},
	Title = {{Parallel search of strongly ordered game trees}},
	Volume = {14},
	Year = {1982}}

@article{Miller93,
	Author = {Miller, D.L. and Pekny, J.F.},
	Journal = {ORSA Journal on Computing},
	Pages = {28--28},
	Title = {{The role of performance metrics for parallel mathematical programming algorithms}},
	Volume = {5},
	Year = {1993}}

@article{Padberg91,
	Author = {Padberg, M. and Rinaldi, G.},
	Journal = {SIAM Review},
	Number = {1},
	Pages = {60--100},
	Title = {{A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems}},
	Volume = {33},
	Year = {1991}}

@book{Pearl84,
	Author = {Pearl, J.},
	Publisher = {Addison-Wesley, Reading, MA},
	Title = {{Heuristics-intelligent search strategies for computer problem solving}},
	Year = {1984}}

@article{Pramanick95,
	Author = {Pramanick, I. and Kuhl, J.G.},
	Journal = {IEEE Transactions on Parallel and Distributed Systems},
	Number = {10},
	Pages = {1006--1015},
	Title = {{An inherently parallel method for heuristic problem-solving. I. General framework}},
	Volume = {6},
	Year = {1995}}

@conference{Ranade91,
	Author = {Ranade, A.G.},
	Booktitle = {Proceedings of the Thrid Annual ACM Symposium on Parallel Algorithms and Architectures},
	Organization = {ACM},
	Pages = {40},
	Title = {{Optimal Speedup for Backtrack Search on a Butterfly Network}},
	Year = {1991}}

@article{Rao93,
	Author = {Rao, V.N. and Kumar, V.},
	Journal = {IEEE Transactions on Parallel and Distributed Systems},
	Number = {4},
	Pages = {427--437},
	Title = {{On the efficiency of parallel backtracking}},
	Volume = {4},
	Year = {1993}}

@article{Rao88,
	Author = {Rao, V.N. and Kumar, V.},
	Journal = {IEEE Transactions on Computers},
	Number = {12},
	Pages = {1657--1665},
	Title = {{Concurrent access of priority queues}},
	Volume = {37},
	Year = {1988}}

@article{Roucairol87,
	Author = {Roucairol, C.},
	Journal = {Discrete Applied Mathematics},
	Number = {2},
	Pages = {211--225},
	Publisher = {Elsevier},
	Title = {{A parallel branch and bound algorithm for the quadratic assignment problem}},
	Volume = {18},
	Year = {1987}}

@conference{Tschoke95,
	Author = {Tsch{\"o}ke, S. and L{\"u}ling, R. and Monien, B.},
	Booktitle = {Proceedings of the 9th International Symposium on Parallel Processing},
	Pages = {182--189},
	Title = {{Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network}},
	Year = {1995}}

@article{Wah85,
	Author = {Wah, B.W. and Li, G.J. and Yu, C.F.},
	Journal = {IEEE Computer},
	Number = {6},
	Pages = {93--108},
	Title = {{Multiprocessing of combinatorial search problems}},
	Volume = {18},
	Year = {1985}}

@article{Wah84,
	Author = {Wah, B.W. and Ma, Y.W.E.},
	Journal = {IEEE Transactions on Computers},
	Number = {5},
	Pages = {377--390},
	Title = {{MANIP-A multicomputer architecture for solving combinatorial extremum-search problems}},
	Volume = {33},
	Year = {1984}}

@misc{Lov93,
	Author = {L\'{a}szl\'{o} Lov\'{a}sz},
	Title = {Random Walks on Graphs: A Survey},
	Year = {1993}}

@misc{David10,
	Author = {David Aldous and Jim Fill},
	Title = {Reversible Markov Chains and Random Walks on Graphs},
	Url = {http://stat-www.berkeley.edu/users/aldous/RWG/book.html},
	Year = {2010},
	Bdsk-Url-1 = {http://stat-www.berkeley.edu/users/aldous/RWG/book.html}}

@article{Pemantle07,
	Author = {R. Pemantle},
	Journal = {Probab. Surv. 4, 1--79},
	Pages = {1--79},
	Title = {A survey of random processes with reinforcement},
	Volume = {4},
	Year = {2007}}

@article{DoySne84,
	Author = {Peter~G. Doyle and J.~Laurie Snell},
	Journal = {Carus Math. Monographs},
	Title = {Random walks and electric networks},
	Volume = {22},
	Year = 1984}

@inproceedings{Brand05,
	Author = {Matthew Brand},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {SDM},
	Title = {A Random Walks Perspective on Maximizing Satisfaction and Profit},
	Year = {2005}}

@inproceedings{Yuichi06,
	Author = {Kurumida, Yuichi and Ono, Hirotaka and Sadakane, Kunihiko and Yamashita, Masafumi},
	Booktitle = {Parallel and Distributed Processing and Applications},
	Pages = {39-50},
	Publisher = {Springer Berlin / Heidelberg},
	Title = {Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks},
	Volume = {4330},
	Year = {2006}}

@mastersthesis{Xumaster09,
	Author = {Y. Xu},
	School = {Washington University in St. Louis},
	Title = {Partial Order Reduction for Planning},
	Year = 2009}

@article{Polya,
	Author = {G. P\'{o}lya},
	Journal = {(German) Mathematische Annalen},
	Pages = {149--160},
	Title = {\"{U}ber eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Stra\ss ennetz},
	Volume = {84},
	Year = {1921}}

@misc{Aldous88,
	Author = {David Aldous},
	Title = {Hitting times for random walks on vertex-transitive graphs},
	Year = {1988}}

@inproceedings{ChenLT08,
	Author = {M. Chen and J. Liu and X. Tang},
	Booktitle = {AAAI},
	Pages = {616-621},
	Title = {Clustering via Random Walk Hitting Time on Directed Graphs},
	Year = {2008}}

@article{Pal09,
	Author = {J. Palacios},
	Journal = {Statistics \& Probability Letters},
	Month = {January},
	Number = {2},
	Pages = {234-236},
	Title = {On hitting times of random walks on trees},
	Volume = {79},
	Year = 2009}

@article{1526980,
	Author = {B. Roberto and Q. Leonardo and B. Roberto},
	Issn = {1530-8669},
	Journal = {Wirel. Commun. Mob. Comput.},
	Number = {5},
	Pages = {719--732},
	Title = {Low hitting time random walks in wireless networks},
	Volume = {9},
	Year = {2009}}

@article{Mon09,
	Author = {R. Montenegro},
	Journal = {Random Structures \& Algorithms},
	Pages = {395--407},
	Title = {The simple random walk and max-degree walk on a directed graph},
	Volume = {34},
	Year = {2009}}

@inproceedings{1833871,
	Author = {Y. Li and Z-L. Zhang},
	Booktitle = {INFOCOM'10: Proceedings of the 29th conference on Information communications},
	Pages = {2775--2783},
	Title = {Random walks on digraphs: a theoretical framework for estimating transmission costs in wireless routing},
	Year = {2010}}

@article{Hastings70,
	Author = {W.K. Hastings},
	Journal = {Biometrika},
	Pages = {97--109},
	Title = {Monte Carlo Sampling Methods Using Markov Chains and Their Applications},
	Volume = {57},
	Year = 1970}

@misc{Xu10,
	Author = {Y. Xu and Y. Chen and Q. Lv and R. Huang},
	Howpublished = {working paper},
	Title = {Theory and Algorithms for Partial Order Based Reduction in Planning},
	Year = {2010}}

@techreport{TR09,
	Author = {Y. Xu and Y. Chen},
	Institution = {Washington University in St. Louis},
	Number = {WUCSE-2009-22},
	Title = {Partial Order Based Reduction in Planning: A Unifying Theory and New Algorithms},
	Year = {2009}}

@inproceedings{Coles08,
	Author = {A. Coles and M. Fox and D. Long and A. Smith},
	Booktitle = {Proc. ICAPS},
	Title = {Additive-Disjunctive Heuristics for Optimal Planning},
	Year = {2008}}

@inproceedings{Helmert08unify,
	Author = {M. Helmert and H. Geffner},
	Booktitle = {Proc. ICAPS},
	Title = {Unifying the Causal Graph and Additive Heuristics},
	Year = {2008}}

@inproceedings{Jussi06,
	Author = {J. Rintanen},
	Booktitle = {Proc. ECAI},
	Title = {Unified definition of heuristics for classical planning},
	Year = {2006}}

@inproceedings{Qiang10,
	Author = {Q. Lv and Y. Xu and R. Huang and Y. Chen},
	Booktitle = {Technical Report WUCSE-2010-29, Department of Computer Science and Engineering, Washington University in St. Louis},
	Title = {Cloud Computing for Scalable Planning by Stochastic Search},
	Url = {http://cse.wustl.edu/Research/Lists/Technical Reports/Attachments/923/parallel-mrw.pdf},
	Year = {2010},
	Bdsk-Url-1 = {http://cse.wustl.edu/Research/Lists/Technical%20Reports/Attachments/923/parallel-mrw.pdf}}

@inproceedings{Valenzano10,
	Author = {R. Valenzano and N. Sturtevant and J. Schaeffer and K. Buro and A. Kishimoto},
	Booktitle = {Proc. ICAPS},
	Title = {Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms},
	Year = {2010}}

@inproceedings{Mandelbrot60,
	Author = {Mandelbrot, B.},
	Booktitle = {Econom},
	Pages = {79-106},
	Title = {The Pareto-Levy law and the distribution of income, Internat},
	Volume = {1},
	Year = {1960}}

@book{Gomes97,
	Author = {Carla P. Gomes, Bart Selman and Nuno Crato},
	Pages = {121-135},
	Publisher = {Principles and Practice of Constraint Programming-CP97},
	Title = {Heavy-tailed distributions in combinatorial search},
	Year = 1997}

@book{Rish97,
	Author = {Irina Rish and Daniel Frost},
	Pages = {150-162},
	Publisher = {Principles and Practice of Constraint Programming-CP97},
	Title = {Statistical analysis of backtracking on inconsistent CSPs},
	Year = {1997}}

@book{Adler98,
	Author = {R. Adler and R. Feldman and M. Taqqu},
	Publisher = {Boston: Birkh[ddot{a}]user},
	Title = {A Practical Guide to Heavy Tails},
	Year = {1998}}

@article{Gomes00-2,
	Author = {C. P. Gomes and B. Selman},
	Journal = {Automated Reasoning},
	Pages = {67-100},
	Title = {Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems},
	Volume = {24},
	Year = {2000}}

@article{Frank97whengravity,
	Author = {Jeremy D. Frank and Peter Cheeseman and John Stutz},
	Journal = {Journal of Artificial Intelligence Research},
	Pages = {249--281},
	Title = {When Gravity Fails: Local Search Topology},
	Volume = {7},
	Year = {1997}}

@inproceedings{Hampson93plateausand,
	Author = {Steven Hampson and Dennis Kibler},
	Booktitle = {The 2nd DIMACS Implementation Challenge},
	Pages = {437--456},
	Title = {Plateaus and Plateau Search in Boolean Satisfiability Problems: When to Give Up Searching and Start Again},
	Year = {1993}}

@inproceedings{Kautz96pushingthe,
	Author = {Henry Kautz and Bart Selman},
	Booktitle = {Proc. AAAI},
	Title = {Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search},
	Year = {1996},
}

@inproceedings{gvalue,
  	author    = {J. Benton and
               Kartik Talamadupula and
               Patrick Eyerich and
               Robert Mattm{\"u}ller and
               Subbarao Kambhampati},
  title     = {G-Value Plateaus: A Challenge for Planning},
  booktitle = {Proc. ICAPS},
  year      = {2010},
  pages     = {259-262},
}


@book{Glover:1997:TS:549765,
 author = {Glover, Fred and Laguna, Manuel},
 title = {Tabu Search},
 year = {1997},
 isbn = {079239965X},
 publisher = {Kluwer Academic Publishers},
 address = {Norwell, MA, USA},
} 